Edge‐coloring linear hypergraphs with medium‐sized edges
نویسندگان
چکیده
منابع مشابه
Color critical hypergraphs with many edges
We show that for all k ≥ 3, r > l ≥ 2 there exists constant c = c(k, r, l) such that for large enough n there exists a k-colour-critical r-uniform hypergraph on less than n vertices, having more than cn edges, and having no l-set of vertices occuring in more than one edge.
متن کاملColoring uniform hypergraphs with few edges
A hypergraph is b-simple if no two distinct edges share more than b vertices. Let m(r, t, g) denote the minimum number of edges in an r-uniform non-t-colorable hypergraph of girth at least g. Erdős and Lovász proved that m(r, t, 3) ≥ t 2(r−2) 16r(r − 1)2 and m(r, t, g) ≤ 4 · 20g−1r3g−5t(g−1)(r+1). A result of Szabó improves the lower bound by a factor of r2− for sufficiently large r. We improve...
متن کاملEssential edges in Poisson random hypergraphs
Consider a random hypergraph on a set of N vertices in which, for 1 k N, a Poisson (N k) number of hyperedges is scattered randomly over all subsets of size k. We collapse the hypergraph by running the following algorithm to exhaustion: Pick a vertex having a 1-edge and remove it; collapse the hyperedges over that vertex onto their remaining vertices; repeat until there are no 1-edges left. We ...
متن کاملConflict-Free Colourings of Uniform Hypergraphs With Few Edges
A coloring of the vertices of a hypergraph H is called conflict-free if each edge e of H contains a vertex whose color does not get repeated in e. The smallest number of colors required for such a coloring is called the conflict-free chromatic number of H, and is denoted by χCF (H). Pach and Tardos studied this parameter for graphs and hypergraphs. Among other things, they proved that for an (2...
متن کاملHigh Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k. This implies that there are sparse hypergraphs such that in any coloring of their vertices with at most k − 1 colors there is a monochromatic hyperedge. We show that for any integers r, g ≥ 2 there is an r-uniform hypergraph of gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2019
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20843